Formal Verification of Distributed Mutual-exclusion Circuits
نویسندگان
چکیده
Distributed mutual-exclusion (DME) circuits are an interesting example of asynchronous circuits. They are composed of identical DME cells connected in a ring of arbitrary size. Each DME cell provides a connection point for one user, and all users compete for exclusive access to a shared resource. This paper reports about formal verification of two well-known DME circuit implementations. External behaviour of the circuits is described with a simple process, whereas the required properties are expressed with temporal logic ACTL. We were able to detect hazards and verify correctness of external behaviour of the circuits under the fundamental mode of operation. Formalna verifikacija vezij za porazdeljeno medsebojno izključevanje Ključne besede: Asinhrono vezje, Fundamentalni način, Procesna algebra, Preverjanje modelov, ACTL Povzetek: Vezja za porazdeljeno medsebojno izključevanje (DME) so zanimiv primer asinhronih vezij. Sestavljena so iz enakih celic DME, povezanih v obroč poljubne velikosti. Vsaka od celic DME ponuja priključno točko za enega uporabnika in vsi uporabniki med seboj tekmujejo za izključen dostop do skupnega vira. V članku obravnavamo formalno verifikacijo dveh znanih izvedb vezja DME. Obnašanje vezij opišemo s preprostim procesom, zahtevane lastnosti pa s temporalno logiko ACTL. Na ta način smo lahko odkrili hazarde ter verificirali pravilnost obnašanja vezij v fundamentalnem načinu delovanja.
منابع مشابه
Verification of a Hierarchical Generic Mutual Exclusion Algorithm
In distributed environments, the shared resources access control by mutual exclusion paradigm is a recurrent key problem. To cope with the new constraints implied by recently developed large scale distributed systems like grids, mutual exclusion algorithms become more and more complex and thus much harder to prove and/or verify. In this article, we propose the formal modeling and the verificati...
متن کاملFormal Verification of the Ricart-Agrawala Algorithm
This paper presents the first formal verification of the RicartAgrawala algorithm [RA81] for distributed mutual exclusion of an arbitrary number of nodes. It uses the Temporal Methodology of [MP95a]. We establish both the safety property of mutual exclusion and the liveness property of accessibility . To establish these properties for an arbitrary number of nodes, parameterized proof rules are ...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملAsynchronous circuit development with Workcraft
WORKCRAFT is a plugin-based development system designed to create various mathematical models. It is integrated with such external tools as PETRIFY, PUNF and MPSAT and can simplify and partially automate the design or asynchronous systems. In this work we augment WORKCRAFT with a new plugin targeted at modelling, simulation and formal verification of digital circuits. We model a digital circuit...
متن کاملFormally Modeling and Verifying Ricart&Agrawala Distributed Mutual Exclusion Algorithm
One of the promising approaches to creating quality software is to formally model systems, describe the models in a formal specification language, and verify that the systems have some desirable properties based on the formal documents with an automatic model checker or an interactive theorem prover before the systems are implemented in a programming language. The more complicated the systems a...
متن کامل